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 22, 2026 04:30Kevin HeaveyKevin HeaveyScore: 4,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 04:374,35746,098,43734,043,0002,123,0002,113,536
2Jul 22, 2026 04:374,36246,131,11733,947,0002,264,0002,113,536
3Jul 22, 2026 04:374,36246,121,51533,975,0002,232,0002,113,536
4Jul 22, 2026 04:374,36446,153,89834,043,0002,179,0002,113,536
5Jul 22, 2026 04:374,37251,301,28134,179,0002,110,0002,113,536
6Jul 22, 2026 04:374,38646,306,09534,291,0002,113,0002,113,536
7Jul 22, 2026 04:374,40646,455,09834,481,0002,095,0002,113,536
8Jul 22, 2026 04:374,42146,544,06534,590,0002,111,0002,113,536
9Jul 22, 2026 04:374,44346,881,83434,599,0002,286,0002,113,536