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 19, 2026 02:31Josu San MartinJosu San MartinScore: 6,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 02:315,64072,541,72944,823,0001,992,0002,531,328
2Feb 19, 2026 02:315,90974,606,41947,042,0002,001,0002,441,216
3Feb 19, 2026 02:315,97473,032,58448,573,0001,011,0002,441,216
4Feb 19, 2026 02:316,00177,979,13148,811,000996,0002,445,312
5Feb 19, 2026 02:316,03573,635,71448,091,0002,003,0002,289,664
6Feb 19, 2026 02:316,04173,968,66348,136,0002,005,0002,441,216