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 13, 2026 19:28Victor MerckléVictor MerckléScore: 1,999,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:301,999,56816,603,826,97516,595,277,0001,144,0002,117,632stderr
2May 13, 2026 19:301,999,59516,607,484,91116,593,613,0003,032,0002,117,632stderr
3May 13, 2026 19:301,999,68416,606,552,61016,596,260,0001,118,0002,117,632stderr
4May 13, 2026 19:301,999,76016,605,796,73616,595,826,0002,184,0002,117,632stderr
5May 13, 2026 19:301,999,79416,606,187,71316,595,287,0003,011,0002,117,632stderr
6May 13, 2026 19:301,999,83516,607,860,53416,597,634,0001,003,0002,117,632stderr
7May 13, 2026 19:301,999,85216,610,904,42216,597,775,0001,002,0002,117,632stderr
8May 13, 2026 19:301,999,87616,609,203,99716,597,977,0001,000,0002,117,632stderr
9May 13, 2026 19:301,999,97516,609,911,60416,598,798,0001,000,0002,117,632stderr