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 11, 2026 21:38olliecrowolliecrowScore: 6,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 21:385,64774,211,47943,882,0002,992,0002,408,448
2Feb 11, 2026 21:465,65071,229,83741,910,0004,989,0002,371,584
3Feb 11, 2026 21:465,67070,274,19545,062,0002,002,0002,383,872
4Feb 11, 2026 21:385,69279,139,47543,223,0004,020,0002,383,872
5Feb 11, 2026 21:385,88284,504,79545,833,0002,989,0002,363,392
6Feb 11, 2026 21:465,93379,223,54147,232,0002,009,0002,506,752
7Feb 11, 2026 21:466,01180,950,23247,900,0001,995,0002,453,504
8Feb 11, 2026 21:386,03474,188,05647,081,0003,005,0002,387,968
9Feb 11, 2026 21:466,05076,065,99948,208,0002,008,0002,379,776
10Feb 11, 2026 21:386,05580,426,79349,249,0001,005,0002,293,760
11Feb 11, 2026 21:386,08681,900,80549,527,000990,0002,289,664
12Feb 11, 2026 21:466,12375,379,70849,821,000996,0002,441,216