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 listMay 17, 2026 13:47Victor MerckléVictor MerckléScore: 7,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:527,41369,071,39260,458,0001,075,0002,113,536
2May 17, 2026 13:527,41970,581,28760,507,0001,077,0002,113,536
3May 17, 2026 13:527,42168,968,93960,510,0001,088,0002,113,536
4May 17, 2026 13:527,42168,807,86260,527,0001,073,0002,113,536
5May 17, 2026 13:527,42269,436,60860,600,0001,009,0002,113,536
6May 17, 2026 13:527,44670,152,33960,764,0001,041,0002,113,536
7May 17, 2026 13:527,47769,292,91061,062,0001,001,0002,113,536
8May 17, 2026 13:527,49570,684,95361,115,0001,096,0002,113,536
9May 17, 2026 13:527,58970,351,39961,914,0001,079,0002,113,536