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 31, 2026 18:00olliecrowolliecrowScore: 6,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 18:006,65182,749,51749,181,0006,022,0002,392,064
2Jan 31, 2026 18:006,66179,834,38349,253,0006,031,0002,449,408
3Jan 31, 2026 18:006,69984,387,49752,567,0003,032,0002,281,472
4Jan 31, 2026 18:006,94585,050,33056,633,0001,011,0002,408,448
5Jan 31, 2026 18:007,00083,288,34653,094,0005,008,0002,363,392
6Jan 31, 2026 18:007,00382,380,83255,117,0003,006,0002,506,752