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 listMay 20, 2026 05:58M-RochatM-RochatScore: 11,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:5811,777107,951,60495,435,0002,318,0002,113,536
2May 20, 2026 05:5811,790109,768,91195,509,0002,350,0002,113,536
3May 20, 2026 05:5811,797109,860,17795,563,0002,354,0002,113,536
4May 20, 2026 05:5811,805108,403,70095,638,0002,346,0002,113,536
5May 20, 2026 05:5811,806108,664,27795,648,0002,347,0002,113,536
6May 20, 2026 05:5811,808109,680,63595,656,0002,355,0002,113,536
7May 20, 2026 05:5811,811107,653,75595,706,0002,331,0002,113,536
8May 20, 2026 05:5811,821110,290,07995,763,0002,353,0002,113,536
9May 20, 2026 05:5811,901108,989,61996,718,0002,067,0002,113,536