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 listOct 3, 2026 21:09Tim RaddatzTim RaddatzScore: 89,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 21:0989,001749,056,445679,809,00058,902,0002,113,536
2Oct 3, 2026 21:0989,040749,489,505679,166,00059,872,0002,117,632
3Oct 3, 2026 21:0989,064749,584,469680,115,00059,118,0002,113,536