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 listMar 17, 2026 03:02zielajzielajScore: 3,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 03:023,49052,210,56226,967,0001,997,0002,523,136
2Mar 17, 2026 03:023,49350,155,74126,997,0001,999,0002,437,120
3Mar 17, 2026 03:023,49353,903,49126,997,0001,999,0002,523,136
4Mar 17, 2026 03:003,50049,447,64927,049,0002,003,0002,519,040
5Mar 17, 2026 03:003,50251,835,17227,063,0002,004,0002,445,312
6Mar 17, 2026 03:023,50754,701,53727,099,0002,007,0002,445,312
7Mar 17, 2026 03:023,51452,934,60027,152,0002,011,0002,523,136
8Mar 17, 2026 03:023,51551,820,57227,163,0002,012,0002,441,216
9Mar 17, 2026 03:023,52153,224,67327,208,0002,015,0002,486,272
10Mar 17, 2026 03:023,52754,711,10027,256,0002,019,0002,260,992
11Mar 17, 2026 03:003,52852,030,89527,263,0002,019,0002,523,136
12Mar 17, 2026 03:023,53056,550,86527,278,0002,020,0002,260,992