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 20, 2026 18:54A_ShamanA_ShamanScore: 61,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:5461,678521,007,625452,542,00059,389,0002,113,536
2Jun 20, 2026 18:5461,681521,421,161451,915,00060,038,0002,113,536
3Jun 20, 2026 18:5461,784522,184,888451,574,00061,240,0002,113,536
4Jun 20, 2026 18:5461,789522,166,292451,912,00060,937,0002,113,536
5Jun 20, 2026 18:5461,805522,153,375452,180,00060,808,0002,113,536
6Jun 20, 2026 18:5461,842522,363,478452,766,00060,528,0002,113,536
7Jun 20, 2026 18:5461,893522,761,500452,077,00061,638,0002,113,536
8Jun 20, 2026 18:5461,906522,911,174452,737,00061,090,0002,113,536
9Jun 20, 2026 18:5461,981523,870,438452,327,00062,119,0002,113,536