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 8, 2026 19:36Victor MerckléVictor MerckléScore: 42,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 19:3742,807362,977,371354,224,0001,075,0002,113,536
2Jun 8, 2026 19:3742,881363,594,909354,774,0001,142,0002,113,536
3Jun 8, 2026 19:3742,932364,015,435355,279,0001,057,0002,113,536
4Jun 8, 2026 19:3742,941366,430,947355,292,0001,122,0002,113,536
5Jun 8, 2026 19:3742,942364,098,405355,355,0001,069,0002,113,536
6Jun 8, 2026 19:3742,997364,778,450355,788,0001,092,0002,113,536
7Jun 8, 2026 19:3743,057365,162,601356,231,0001,146,0002,113,536
8Jun 8, 2026 19:3743,672371,571,312361,410,0001,070,0002,113,536
9Jun 8, 2026 19:3744,606377,939,469369,166,0001,066,0002,113,536