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 4, 2026 00:47Josu San MartinJosu San MartinScore: 5,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:475,11151,734,01339,023,0003,406,0002,113,536
2Jul 4, 2026 00:475,14952,110,11339,336,0003,405,0002,113,536
3Jul 4, 2026 00:475,16152,281,94439,467,0003,372,0002,113,536
4Jul 4, 2026 00:475,16252,195,55039,405,0003,442,0002,113,536
5Jul 4, 2026 00:475,17252,326,66939,506,0003,426,0002,113,536
6Jul 4, 2026 00:475,18152,408,05839,538,0003,471,0002,113,536
7Jul 4, 2026 00:475,21052,658,86839,920,0003,324,0002,113,536
8Jul 4, 2026 00:475,21252,642,23639,860,0003,407,0002,113,536
9Jul 4, 2026 00:476,20260,806,76048,118,0003,365,0002,113,536