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 listJul 3, 2026 23:49Josu San MartinJosu San MartinScore: 7,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 23:497,41870,913,29252,890,0008,686,0002,113,536
2Jul 3, 2026 23:497,43571,062,63553,104,0008,613,0002,113,536
3Jul 3, 2026 23:497,44071,182,89653,180,0008,574,0002,113,536
4Jul 3, 2026 23:497,44971,186,78653,270,0008,559,0002,113,536
5Jul 3, 2026 23:497,45071,149,63353,308,0008,534,0002,113,536
6Jul 3, 2026 23:497,45371,196,05453,316,0008,552,0002,113,536
7Jul 3, 2026 23:497,48171,533,00253,506,0008,592,0002,113,536
8Jul 3, 2026 23:497,48871,604,41252,700,0009,455,0002,113,536
9Jul 3, 2026 23:497,49471,550,27452,720,0009,483,0002,113,536