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 27, 2026 17:41wnwnScore: 4,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 17:414,26261,210,17934,361,0001,010,0002,494,464
2Mar 27, 2026 17:414,27156,551,95634,437,0001,012,0002,490,368
3Mar 27, 2026 17:414,27258,566,37634,443,0001,013,0002,494,464
4Mar 27, 2026 17:414,27663,218,93934,478,0001,014,0002,502,656
5Mar 27, 2026 17:414,28055,427,90834,507,0001,014,0002,277,376
6Mar 27, 2026 17:414,28059,679,94534,511,0001,015,0002,277,376
7Mar 27, 2026 17:414,28561,076,07134,553,0001,016,0002,494,464
8Mar 27, 2026 17:414,31759,524,09733,842,0001,990,0002,273,280
9Mar 27, 2026 17:414,33261,212,53333,956,0001,997,0002,277,376