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 21, 2026 21:12Kevin HeaveyKevin HeaveyScore: 70,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 21:1368,809580,854,884567,800,0003,315,0002,121,728
2Jul 21, 2026 21:1369,254584,477,926571,801,0003,013,0002,121,728
3Jul 21, 2026 21:1369,638587,765,251573,927,0004,070,0002,121,728
4Jul 21, 2026 21:1370,154591,995,583578,047,0004,237,0002,125,824
5Jul 21, 2026 21:1370,209592,535,285578,602,0004,135,0002,125,824
6Jul 21, 2026 21:1370,649596,010,010583,167,0003,225,0002,125,824
7Jul 21, 2026 21:1371,140600,122,672587,452,0003,015,0002,121,728
8Jul 21, 2026 21:1373,831622,573,944609,754,0003,049,0002,121,728
9Jul 21, 2026 21:1374,565628,650,050614,833,0004,063,0002,121,728