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 listJun 28, 2026 13:35Victor MerckléVictor MerckléScore: 5,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 13:365,16350,602,70941,783,0001,078,0002,113,536
2Jun 28, 2026 13:365,17950,730,72141,919,0001,068,0002,113,536
3Jun 28, 2026 13:365,18050,902,22641,915,0001,083,0002,113,536
4Jun 28, 2026 13:365,18450,751,42441,975,0001,058,0002,113,536
5Jun 28, 2026 13:365,18750,808,55642,055,0001,005,0002,113,536
6Jun 28, 2026 13:365,19250,770,66742,092,0001,009,0002,113,536
7Jun 28, 2026 13:365,20451,022,12142,132,0001,062,0002,113,536
8Jun 28, 2026 13:365,21151,101,71742,205,0001,051,0002,113,536
9Jun 28, 2026 13:365,21450,964,15442,192,0001,085,0002,113,536