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 8, 2026 07:11flavio87flavio87Score: 10,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 07:1210,256100,665,44484,101,0001,025,0002,367,488
2May 8, 2026 07:1210,261100,193,76483,145,0002,022,0002,334,720
3May 8, 2026 07:1210,268102,356,52483,194,0002,032,0002,351,104
4May 8, 2026 07:1210,277102,211,19883,266,0002,036,0002,363,392
5May 8, 2026 07:1210,293101,583,78183,421,0002,017,0002,371,584
6May 8, 2026 07:1210,302102,616,85083,488,0002,021,0002,334,720
7May 8, 2026 07:1210,316102,618,40883,602,0002,022,0002,375,680
8May 8, 2026 07:1210,336102,956,09083,743,0002,054,0002,355,200
9May 8, 2026 07:1210,36599,010,33883,968,0002,064,0002,404,352