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:39chereshnya123chereshnya123Score: 64,455Success
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:3964,391544,163,726475,495,00058,954,0002,113,536
2Jun 6, 2026 15:3964,406543,907,892476,116,00058,456,0002,113,536
3Jun 6, 2026 15:3964,410544,259,668477,221,00057,385,0002,113,536
4Jun 6, 2026 15:3964,424543,896,227476,025,00058,695,0002,113,536
5Jun 6, 2026 15:3964,455547,774,320475,878,00059,101,0002,113,536
6Jun 6, 2026 15:3964,604545,929,286476,195,00060,021,0002,113,536
7Jun 6, 2026 15:3964,641545,738,105475,629,00060,899,0002,113,536
8Jun 6, 2026 15:3964,689546,665,866476,792,00060,127,0002,113,536
9Jun 6, 2026 15:3964,742547,181,964478,431,00058,930,0002,113,536