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 29, 2026 08:03olliecrowolliecrowScore: 7,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 08:037,49276,078,75059,181,0003,009,0002,519,040
2Apr 29, 2026 08:037,51879,941,22259,387,0003,019,0002,486,272
3Apr 29, 2026 08:037,52280,280,10958,411,0004,028,0002,433,024
4Apr 29, 2026 08:037,52280,564,23958,407,0004,028,0002,486,272
5Apr 29, 2026 08:037,53279,124,97062,521,00002,551,808
6Apr 29, 2026 08:037,54984,557,32459,630,0003,032,0002,416,640
7Apr 29, 2026 08:037,55479,813,70858,725,0003,981,0002,494,464
8Apr 29, 2026 08:037,56281,341,29260,778,0001,992,0002,482,176
9Apr 29, 2026 08:037,75780,776,79062,373,0002,012,0002,539,520