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 listAug 4, 2026 15:55boop34boop34Score: 28,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 15:5628,160243,765,197232,698,0001,030,0002,113,536
2Aug 4, 2026 15:5628,166243,874,893232,724,0001,060,0002,113,536
3Aug 4, 2026 15:5628,187244,686,473232,898,0001,056,0002,113,536
4Aug 4, 2026 15:5628,228244,400,957233,280,0001,019,0002,113,536
5Aug 4, 2026 15:5628,254245,374,472233,421,0001,093,0002,113,536
6Aug 4, 2026 15:5628,257244,563,300233,487,0001,052,0002,113,536
7Aug 4, 2026 15:5629,400254,042,676242,967,0001,060,0002,113,536
8Aug 4, 2026 15:5629,401254,966,664242,943,0001,090,0002,113,536
9Aug 4, 2026 15:5629,402254,133,906243,016,0001,025,0002,113,536