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 listMay 10, 2026 17:56Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 17:57044,862,72233,809,0001,049,0002,113,536expected "53685092076979153 ", got "53685091820979153 "
2May 10, 2026 17:574,17842,253,08733,643,0001,038,0002,113,536
3May 10, 2026 17:574,20242,704,76733,819,0001,063,0002,113,536
4May 10, 2026 17:574,20645,700,30233,876,0001,041,0002,113,536
5May 10, 2026 17:574,21245,346,20733,916,0001,048,0002,113,536
6May 10, 2026 17:574,21243,117,75233,897,0001,063,0002,113,536
7May 10, 2026 17:574,23345,019,56134,066,0001,073,0002,113,536
8May 10, 2026 17:574,26445,467,77334,347,0001,052,0002,113,536
9May 10, 2026 17:574,35546,740,75635,073,0001,076,0002,113,536