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 listAug 31, 2026 10:45Victor MerckléVictor MerckléScore: 4,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:464,15742,932,09433,415,0001,092,0002,113,536
2Aug 31, 2026 10:464,17343,066,90133,549,0001,087,0002,113,536
3Aug 31, 2026 10:464,17443,441,18433,548,0001,104,0002,113,536
4Aug 31, 2026 10:464,17743,063,29933,548,0001,126,0002,113,536
5Aug 31, 2026 10:464,18142,999,38733,641,0001,069,0002,113,536
6Aug 31, 2026 10:464,18243,127,44933,592,0001,123,0002,113,536
7Aug 31, 2026 10:464,18343,081,54233,626,0001,096,0002,113,536
8Aug 31, 2026 10:464,20043,469,35333,739,0001,123,0002,113,536
9Aug 31, 2026 10:464,20443,334,04533,787,0001,109,0002,113,536