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 9, 2026 20:51Daniel MastalerzDaniel MastalerzScore: 9,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:519,493109,964,32177,795,000997,0002,408,448
2Feb 9, 2026 20:519,494104,301,28173,814,0004,987,0002,310,144
3Feb 9, 2026 20:519,497102,617,18473,834,0004,988,0002,314,240
4Feb 9, 2026 20:519,498104,238,71174,843,0003,991,0002,338,816
5Feb 9, 2026 20:519,502100,763,41073,873,0004,991,0002,400,256
6Feb 9, 2026 20:519,507103,062,64574,914,0003,995,0002,400,256
7Feb 9, 2026 20:519,519106,028,98174,007,0005,000,0002,392,064
8Feb 9, 2026 20:519,539104,202,67675,165,0004,008,0002,326,528
9Feb 9, 2026 20:519,552102,231,08775,264,0004,014,0002,396,160