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 listJan 1, 2026 19:30Josu San MartinJosu San MartinScore: 9,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 19:309,086101,888,60573,405,0002,011,0002,433,024
2Jan 1, 2026 19:309,09299,159,59872,444,0003,018,0002,375,680
3Jan 1, 2026 19:309,13098,824,16874,769,0001,010,0002,453,504
4Jan 1, 2026 19:309,40099,064,03376,021,0002,000,0002,473,984
5Jan 1, 2026 19:309,432104,684,36874,271,0004,014,0002,359,296
6Jan 1, 2026 19:309,44898,284,25374,394,0004,021,0002,375,680