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 listJul 31, 2026 17:50George SeabridgeGeorge SeabridgeScore: 9,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:519,20886,463,35075,419,0001,010,0002,117,632
2Jul 31, 2026 17:519,21386,460,32775,452,0001,022,0002,117,632
3Jul 31, 2026 17:519,21486,725,99875,456,0001,021,0002,117,632
4Jul 31, 2026 17:519,22886,548,05875,572,0001,022,0002,117,632
5Jul 31, 2026 17:519,23886,691,00075,657,0001,021,0002,117,632
6Jul 31, 2026 17:519,24186,742,15975,679,0001,023,0002,117,632
7Jul 31, 2026 17:519,25786,867,14475,824,0001,013,0002,117,632
8Jul 31, 2026 17:519,25986,907,39775,827,0001,023,0002,117,632
9Jul 31, 2026 17:519,29187,111,96276,096,0001,022,0002,117,632