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 listSep 23, 2026 07:15Kevin HeaveyKevin HeaveyScore: 3,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:213,33136,502,88326,494,0001,160,0002,113,536
2Sep 23, 2026 07:213,33737,322,66226,634,0001,064,0002,113,536
3Sep 23, 2026 07:213,34236,634,23726,729,0001,012,0002,113,536
4Sep 23, 2026 07:213,34236,609,38026,594,0001,148,0002,113,536
5Sep 23, 2026 07:213,34337,362,01726,696,0001,052,0002,113,536
6Sep 23, 2026 07:213,34437,279,08426,734,0001,027,0002,113,536
7Sep 23, 2026 07:213,34937,351,35326,772,0001,028,0002,113,536
8Sep 23, 2026 07:213,35738,756,79226,832,0001,037,0002,113,536
9Sep 23, 2026 07:213,38037,163,15826,833,0001,223,0002,113,536