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 listFeb 16, 2026 10:10tch1001tch1001Score: 58,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 10:1058,649518,221,657485,791,000999,0002,392,064
2Feb 16, 2026 10:1058,669511,220,545482,955,0003,999,0002,273,280
3Feb 16, 2026 10:1058,670511,993,420485,961,000999,0002,273,280
4Feb 16, 2026 10:1058,671514,934,437485,968,000999,0002,273,280
5Feb 16, 2026 10:1058,674516,834,602486,994,00002,400,256
6Feb 16, 2026 10:1058,675518,626,690486,003,0001,000,0002,273,280
7Feb 16, 2026 10:1058,677509,048,864487,017,00002,273,280
8Feb 16, 2026 10:1058,690515,551,293487,130,00002,400,256
9Feb 16, 2026 10:1058,703509,625,056487,238,00002,273,280