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 listJan 2, 2026 16:48Josu San MartinJosu San MartinScore: 6,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 16:486,24979,659,22550,868,000997,0002,387,968
2Jan 2, 2026 16:506,32579,444,24446,439,0006,057,0002,449,408
3Jan 2, 2026 16:506,36476,279,37351,806,0001,015,0002,387,968
4Jan 2, 2026 16:506,39376,355,36851,064,0002,002,0002,404,352
5Jan 2, 2026 16:486,46978,603,48950,707,0002,982,0002,281,472
6Jan 2, 2026 16:486,53978,037,72251,262,0003,015,0002,408,448
7Jan 2, 2026 16:486,90279,187,19156,284,0001,005,0002,449,408
8Jan 2, 2026 16:506,90378,571,11752,266,0005,025,0002,297,856
9Jan 2, 2026 16:486,94689,887,13155,630,0002,022,0002,293,760
10Jan 2, 2026 16:506,97787,037,99254,915,0002,995,0002,322,432
11Jan 2, 2026 16:507,00878,609,69255,162,0003,008,0002,510,848
12Jan 2, 2026 16:487,01680,953,85155,223,0003,012,0002,330,624