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 listJul 31, 2026 13:11George SeabridgeGeorge SeabridgeScore: 40,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:1239,950341,535,598330,542,0001,051,0002,117,632
2Jul 31, 2026 13:1239,962341,767,295330,559,0001,133,0002,117,632
3Jul 31, 2026 13:1240,013342,205,302330,969,0001,146,0002,117,632
4Jul 31, 2026 13:1240,075342,683,494331,490,0001,140,0002,117,632
5Jul 31, 2026 13:1240,203343,779,500332,523,0001,163,0002,117,632
6Jul 31, 2026 13:1240,671347,571,833336,413,0001,164,0002,117,632
7Jul 31, 2026 13:1241,144351,597,627340,348,0001,149,0002,117,632
8Jul 31, 2026 13:1241,162351,605,083340,498,0001,147,0002,117,632
9Jul 31, 2026 13:1241,320353,087,779341,951,0001,006,0002,117,632