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 25, 2026 19:21Victor MerckléVictor MerckléScore: 4,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 19:224,18842,365,25733,665,0001,101,0002,113,536
2Jun 25, 2026 19:224,20242,434,19933,857,0001,022,0002,113,536
3Jun 25, 2026 19:224,20342,482,81933,793,0001,092,0002,113,536
4Jun 25, 2026 19:224,20642,502,95533,813,0001,104,0002,113,536
5Jun 25, 2026 19:224,20742,461,15733,805,0001,115,0002,113,536
6Jun 25, 2026 19:224,21342,504,71833,954,0001,019,0002,113,536
7Jun 25, 2026 19:224,21542,848,26533,882,0001,104,0002,113,536
8Jun 25, 2026 19:224,30343,323,13834,637,0001,080,0002,113,536
9Jun 25, 2026 19:224,31843,337,40734,757,0001,089,0002,113,536