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 2, 2026 08:28George SeabridgeGeorge SeabridgeScore: 8,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 08:288,29578,785,82967,778,0001,078,0002,113,536
2Aug 2, 2026 08:288,30679,640,97167,860,0001,081,0002,113,536
3Aug 2, 2026 08:288,30879,690,24367,872,0001,091,0002,113,536
4Aug 2, 2026 08:288,30981,211,56067,873,0001,099,0002,113,536
5Aug 2, 2026 08:288,31178,968,58267,903,0001,086,0002,113,536
6Aug 2, 2026 08:288,32278,966,34967,976,0001,103,0002,113,536
7Aug 2, 2026 08:288,32680,001,49567,999,0001,108,0002,113,536
8Aug 2, 2026 08:288,32779,090,99367,840,0001,277,0002,113,536
9Aug 2, 2026 08:288,33279,463,56468,034,0001,125,0002,113,536