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 listJun 24, 2026 23:57Victor MerckléVictor MerckléScore: 4,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:584,51945,115,96836,424,0001,085,0002,113,536
2Jun 24, 2026 23:584,52145,176,89936,445,0001,085,0002,113,536
3Jun 24, 2026 23:584,53245,113,15136,511,0001,106,0002,113,536
4Jun 24, 2026 23:584,53745,222,94536,560,0001,102,0002,113,536
5Jun 24, 2026 23:584,54545,573,00336,617,0001,113,0002,113,536
6Jun 24, 2026 23:584,58445,620,64837,036,0001,014,0002,113,536
7Jun 24, 2026 23:584,61045,934,58837,242,0001,027,0002,113,536
8Jun 24, 2026 23:584,69246,567,04737,830,0001,115,0002,113,536
9Jun 24, 2026 23:584,75847,755,26638,481,0001,018,0002,113,536