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 listJun 6, 2026 15:37chereshnya123chereshnya123Score: 58,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:3758,436494,171,019427,095,00057,931,0002,113,536
2Jun 6, 2026 15:3758,481494,584,567427,153,00058,246,0002,113,536
3Jun 6, 2026 15:3758,486494,545,502427,433,00058,008,0002,113,536
4Jun 6, 2026 15:3758,529494,771,529427,203,00058,594,0002,113,536
5Jun 6, 2026 15:3758,618495,758,781427,143,00059,394,0002,113,536
6Jun 6, 2026 15:3758,628495,633,595427,302,00059,313,0002,113,536
7Jun 6, 2026 15:3758,628495,676,712427,401,00059,213,0002,113,536
8Jun 6, 2026 15:3758,636495,804,903427,275,00059,410,0002,113,536
9Jun 6, 2026 15:3758,636496,641,606427,590,00059,089,0002,113,536