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 listApr 24, 2026 08:22Dominique GarmierDominique GarmierScore: 7,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:237,17578,344,74257,539,0002,018,0002,351,104
2Apr 24, 2026 08:237,18775,890,62657,635,0002,022,0002,347,008
3Apr 24, 2026 08:237,22180,169,39758,923,0001,015,0002,342,912
4Apr 24, 2026 08:237,22583,030,51856,977,0002,998,0002,334,720
5Apr 24, 2026 08:237,27076,542,62657,326,0003,017,0002,347,008
6Apr 24, 2026 08:237,27778,881,44458,388,0002,013,0002,351,104
7Apr 24, 2026 08:237,33577,097,95557,889,0002,994,0002,342,912
8Apr 24, 2026 08:237,37478,720,68258,199,0003,010,0002,347,008
9Apr 24, 2026 08:237,38977,834,38659,319,0002,010,0002,441,216