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 01:23Josu San MartinJosu San MartinScore: 6,293Success
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 01:236,07272,153,63849,387,0001,007,0002,400,256
2Feb 19, 2026 01:236,24275,907,84148,819,0002,988,0002,396,160
3Feb 19, 2026 01:236,27575,655,50850,076,0002,003,0002,400,256
4Feb 19, 2026 01:236,29376,382,79051,230,0001,004,0002,519,040
5Feb 19, 2026 01:236,37974,775,73749,947,0002,996,0002,400,256
6Feb 19, 2026 01:236,39179,227,08851,041,0002,001,0002,281,472