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 listFeb 18, 2026 21:02wnwnScore: 26,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 21:0226,628247,191,431220,010,0001,000,0002,539,520
2Feb 18, 2026 21:0226,642242,427,788219,128,0002,001,0002,527,232
3Feb 18, 2026 21:0226,717248,147,952220,749,000998,0002,445,312