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 30, 2026 20:28Josu San MartinJosu San MartinScore: 4,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:284,72547,710,55338,175,0001,046,0002,113,536
2Aug 30, 2026 20:284,73447,699,66538,262,0001,032,0002,113,536
3Aug 30, 2026 20:284,73547,773,40438,264,0001,038,0002,113,536
4Aug 30, 2026 20:284,73547,722,85338,273,0001,030,0002,113,536
5Aug 30, 2026 20:284,74347,895,61538,321,0001,049,0002,113,536
6Aug 30, 2026 20:284,75648,001,50738,355,0001,120,0002,113,536
7Aug 30, 2026 20:284,76548,057,13038,522,0001,030,0002,113,536
8Aug 30, 2026 20:284,78748,189,48938,694,0001,043,0002,113,536
9Aug 30, 2026 20:284,80948,339,68838,840,0001,079,0002,113,536