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 15, 2026 16:30shartgepettoshartgepettoScore: 8,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:308,04196,435,85662,756,0003,984,0002,498,560
2Mar 15, 2026 16:308,047101,024,12163,797,0002,990,0002,437,120
3Mar 15, 2026 16:308,04893,476,61561,817,0004,985,0002,387,968
4Mar 15, 2026 16:308,06393,119,68263,929,0002,996,0002,269,184
5Mar 15, 2026 16:308,06695,887,90861,953,0004,996,0002,396,160
6Mar 15, 2026 16:308,07394,408,30664,010,0003,000,0002,318,336
7Mar 15, 2026 16:308,08490,208,93964,096,0003,004,0002,469,888
8Mar 15, 2026 16:308,11994,147,34463,365,0004,023,0002,502,656
9Mar 15, 2026 16:308,15294,201,48264,633,0003,029,0002,318,336