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 listMay 10, 2026 11:26wnwnScore: 3,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:303,37242,258,03426,959,0001,034,0002,490,368
2May 10, 2026 11:303,38842,672,95927,075,0001,050,0002,490,368
3May 10, 2026 11:303,39140,945,99327,111,0001,041,0002,490,368
4May 10, 2026 11:303,40042,882,34527,139,0001,084,0002,482,176
5May 10, 2026 11:303,40242,798,24227,188,0001,054,0002,490,368
6May 10, 2026 11:303,40445,488,43527,201,0001,058,0002,494,464
7May 10, 2026 11:303,41143,770,56027,246,0001,069,0002,486,272
8May 10, 2026 11:303,54643,569,32128,348,0001,085,0002,490,368
9May 10, 2026 11:303,56145,224,51728,446,0001,111,0002,486,272