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 listJan 30, 2026 19:43olliecrowolliecrowScore: 10,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 19:4310,444110,590,79483,700,0002,989,0002,465,792
2Jan 30, 2026 19:4310,475109,834,58382,943,0003,997,0002,449,408
3Jan 30, 2026 19:4310,486113,911,27084,035,0003,001,0002,449,408
4Jan 30, 2026 19:4310,913117,818,81088,568,0002,012,0002,445,312
5Jan 30, 2026 19:4310,996115,653,60087,256,0004,011,0002,281,472
6Jan 30, 2026 19:4310,997112,832,24788,265,0003,009,0002,281,472
7Jan 30, 2026 19:4310,999121,507,20690,289,0001,003,0002,281,472
8Jan 30, 2026 19:4311,000113,755,86688,293,0003,010,0002,285,568
9Jan 30, 2026 19:4311,064121,768,67487,837,0003,992,0002,281,472
10Jan 30, 2026 19:4311,100120,233,21188,125,0004,005,0002,453,504
11Jan 30, 2026 19:4311,108117,255,72089,193,0003,006,0002,281,472
12Jan 30, 2026 19:4311,238116,116,91689,264,0004,011,0002,281,472