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 21, 2026 01:54Josu San MartinJosu San MartinScore: 6,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 01:546,00771,773,86148,838,0001,017,0002,273,280
2Feb 21, 2026 01:546,03672,328,52948,092,0002,003,0002,281,472
3Feb 21, 2026 01:546,16171,879,72749,134,0002,005,0002,273,280
4Feb 21, 2026 01:546,16876,473,68549,186,0002,007,0002,281,472
5Feb 21, 2026 01:546,17274,113,85650,224,0001,004,0002,277,376
6Feb 21, 2026 01:546,21982,822,87051,620,00002,281,472