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 19, 2026 22:15Mikołaj UzarskiMikołaj UzarskiScore: 5,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:155,93471,909,16345,232,0004,020,0002,457,600
2Feb 19, 2026 22:155,95371,546,80743,362,0006,050,0002,433,024
3Feb 19, 2026 22:156,00274,515,55343,836,0005,977,0002,469,888