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 17, 2026 19:35Navneet RajNavneet RajScore: 89,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 19:3589,010748,527,207680,080,00058,703,0002,117,632
2Aug 17, 2026 19:3589,068749,150,329680,527,00058,745,0002,113,536
3Aug 17, 2026 19:3589,089749,241,523680,356,00059,088,0002,113,536