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 listApr 17, 2026 07:58Charles CabergsCharles CabergsScore: 21,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 07:5821,567202,651,873178,009,0001,000,0002,416,640
2Apr 17, 2026 07:5821,752205,643,025179,542,0001,003,0002,293,760
3Apr 17, 2026 07:5822,120212,752,495182,590,0001,003,0002,285,568