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 15, 2026 00:34wnwnScore: 3,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 00:353,30634,731,01627,447,00002,113,536
2May 15, 2026 00:353,31136,782,22827,488,00002,113,536
3May 15, 2026 00:353,31134,794,14127,486,00002,113,536
4May 15, 2026 00:353,32037,908,14327,559,00002,113,536
5May 15, 2026 00:353,33836,929,27727,709,00002,113,536
6May 15, 2026 00:353,33835,024,41626,705,0001,007,0002,113,536
7May 15, 2026 00:353,38037,194,91128,054,00002,113,536
8May 15, 2026 00:353,53547,670,37728,310,0001,033,0002,113,536
9May 15, 2026 00:353,67550,454,83830,506,00002,113,536