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 listApr 26, 2026 03:00zielajzielajScore: 3,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:013,41645,055,37527,346,0001,012,0002,424,832
2Apr 26, 2026 03:013,44542,607,57527,580,0001,021,0002,428,928
3Apr 26, 2026 03:013,47346,857,46927,840,000994,0002,306,048
4Apr 26, 2026 03:013,47644,656,73626,868,0001,990,0002,424,832
5Apr 26, 2026 03:013,47846,559,84726,883,0001,991,0002,416,640
6Apr 26, 2026 03:013,49344,566,27727,000,0002,000,0002,322,432
7Apr 26, 2026 03:013,49946,708,93027,040,0002,002,0002,310,144
8Apr 26, 2026 03:013,60147,890,30327,897,0001,992,0002,420,736
9Apr 26, 2026 03:013,60345,545,23727,912,0001,993,0002,416,640