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 listMar 19, 2026 01:11Ondřej PolaneckýOndřej PolaneckýScore: 10,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 01:1110,345109,187,73784,865,000998,0002,506,752
2Mar 19, 2026 01:1110,370107,415,36984,074,0002,001,0002,273,280
3Mar 19, 2026 01:1110,464113,957,65984,854,0001,996,0002,273,280