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 listJun 25, 2026 22:29Victor MerckléVictor MerckléScore: 4,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:314,14141,880,75633,300,0001,076,0002,113,536
2Jun 25, 2026 22:314,15441,988,54833,398,0001,086,0002,113,536
3Jun 25, 2026 22:314,15441,940,54533,406,0001,078,0002,113,536
4Jun 25, 2026 22:314,15542,014,97433,388,0001,101,0002,113,536
5Jun 25, 2026 22:314,15642,017,66833,373,0001,126,0002,113,536
6Jun 25, 2026 22:314,15842,002,54233,411,0001,102,0002,113,536
7Jun 25, 2026 22:314,17042,145,76933,542,0001,075,0002,113,536
8Jun 25, 2026 22:314,18042,207,33833,631,0001,065,0002,113,536
9Jun 25, 2026 22:314,31743,315,41734,813,0001,022,0002,113,536