Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 24, 2026 04:58Nao MinamiNao MinamiScore: 18,296Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:5918,251163,752,319150,298,0001,186,0002,113,536
2Oct 24, 2026 04:5918,273163,129,989150,409,0001,258,0002,113,536
3Oct 24, 2026 04:5918,279163,953,314150,712,0001,006,0002,113,536
4Oct 24, 2026 04:5918,284162,757,879150,503,0001,257,0002,113,536
5Oct 24, 2026 04:5918,296163,356,204150,596,0001,269,0002,113,536
6Oct 24, 2026 04:5918,300164,032,332150,626,0001,268,0002,113,536
7Oct 24, 2026 04:5918,305162,915,974150,675,0001,259,0002,113,536
8Oct 24, 2026 04:5918,311162,900,566150,979,0001,003,0002,113,536
9Oct 24, 2026 04:5918,323163,076,503150,813,0001,272,0002,113,536