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 listJun 27, 2026 02:27Code HintsCode HintsScore: 7,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 02:276,92165,123,14554,419,0003,032,0002,113,536
2Jun 27, 2026 02:276,92865,169,50655,463,0002,044,0002,113,536
3Jun 27, 2026 02:276,95665,403,40355,686,0002,057,0002,113,536
4Jun 27, 2026 02:277,00465,829,65256,089,0002,050,0002,113,536
5Jun 27, 2026 02:277,06466,724,15955,609,0003,026,0002,113,536
6Jun 27, 2026 02:277,08266,401,35655,696,0003,086,0002,113,536
7Jun 27, 2026 02:277,16267,130,38656,409,0003,041,0002,113,536
8Jun 27, 2026 02:277,20867,503,68057,775,0002,052,0002,113,536
9Jun 27, 2026 02:277,30668,317,76057,544,0003,103,0002,113,536