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 listApr 26, 2026 15:38wnwnScore: 3,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:393,41842,318,38827,364,0001,013,0002,490,368
2Apr 26, 2026 15:393,43147,233,65727,461,0001,017,0002,330,624
3Apr 26, 2026 15:393,43543,797,05327,493,0001,018,0002,330,624
4Apr 26, 2026 15:393,43945,322,97628,551,00002,490,368
5Apr 26, 2026 15:393,44044,000,29128,558,00002,486,272
6Apr 26, 2026 15:393,44347,709,65827,563,0001,020,0002,490,368
7Apr 26, 2026 15:393,46346,075,71927,717,0001,026,0002,482,176
8Apr 26, 2026 15:393,46644,589,47926,791,0001,984,0002,314,240
9Apr 26, 2026 15:393,53346,229,98128,320,0001,011,0002,486,272