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 listSep 2, 2026 11:29CheckHarryCheckHarryScore: 38,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 11:3037,893324,419,109313,516,0001,004,0002,113,536
2Sep 2, 2026 11:3037,934324,706,967313,852,0001,002,0002,113,536
3Sep 2, 2026 11:3037,945325,018,252313,943,0001,004,0002,113,536
4Sep 2, 2026 11:3038,357328,125,230317,360,0001,004,0002,113,536
5Sep 2, 2026 11:3038,358328,360,819317,365,0001,008,0002,113,536
6Sep 2, 2026 11:3038,365328,283,525317,431,0001,005,0002,113,536
7Sep 2, 2026 11:3038,374328,387,382317,504,0001,003,0002,113,536
8Sep 2, 2026 11:3038,377328,399,265317,527,0001,004,0002,113,536
9Sep 2, 2026 11:3038,382328,390,783317,569,0001,004,0002,113,536