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 00:45Josu San MartinJosu San MartinScore: 6,086Success
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 00:455,91076,718,27047,050,0002,002,0002,273,280
2Feb 21, 2026 00:456,00383,857,27448,830,000996,0002,281,472
3Feb 21, 2026 00:456,03178,291,11848,056,0002,002,0002,519,040
4Feb 21, 2026 00:456,08677,045,24550,511,00002,392,064
5Feb 21, 2026 00:456,13170,796,65249,887,000997,0002,281,472
6Feb 21, 2026 00:456,19075,241,91350,367,0001,007,0002,400,256