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 5, 2026 21:04Kevin HeaveyKevin HeaveyScore: 4,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:054,51046,978,64436,286,0001,152,0002,117,632
2Jul 5, 2026 21:054,52247,105,64736,300,0001,235,0002,117,632
3Jul 5, 2026 21:054,53047,102,94036,366,0001,237,0002,117,632
4Jul 5, 2026 21:054,55247,429,42236,525,0001,257,0002,117,632
5Jul 5, 2026 21:054,55247,329,41336,615,0001,173,0002,117,632
6Jul 5, 2026 21:054,55347,409,36136,629,0001,166,0002,117,632
7Jul 5, 2026 21:054,57547,589,80736,961,0001,019,0002,117,632
8Jul 5, 2026 21:054,61947,951,13537,156,0001,189,0002,117,632
9Jul 5, 2026 21:054,64048,123,33137,348,0001,171,0002,117,632