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 10, 2026 11:17wnwnScore: 11,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:1811,433108,961,61893,878,0001,022,0002,478,080
2May 10, 2026 11:1811,437110,307,80893,899,0001,031,0002,494,464
3May 10, 2026 11:1811,438109,565,22593,900,0001,038,0002,486,272
4May 10, 2026 11:1811,462109,113,68994,108,0001,033,0002,482,176
5May 10, 2026 11:1811,607112,035,96595,273,0001,066,0002,486,272
6May 10, 2026 11:1811,624109,917,13195,429,0001,052,0002,490,368
7May 10, 2026 11:1811,624111,530,28495,420,0001,063,0002,469,888
8May 10, 2026 11:1811,652112,767,39295,666,0001,051,0002,486,272
9May 10, 2026 11:1811,659113,847,43995,681,0001,092,0002,482,176