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 20, 2026 00:08olliecrowolliecrowScore: 5,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 00:055,76070,698,55043,828,0003,984,0002,510,848
2Mar 20, 2026 00:085,76071,189,42345,816,0001,992,0002,441,216
3Mar 20, 2026 00:055,76373,672,33045,798,0002,035,0002,523,136
4Mar 20, 2026 00:115,77773,090,59443,956,0003,996,0002,482,176
5Mar 20, 2026 00:115,78370,532,68945,999,0001,999,0002,453,504
6Mar 20, 2026 00:085,80671,503,90247,186,0001,003,0002,490,368
7Mar 20, 2026 00:085,81770,790,41846,266,0002,011,0002,494,464
8Mar 20, 2026 00:115,81771,190,46345,267,0003,017,0002,457,600
9Mar 20, 2026 00:055,92876,410,37646,191,0003,012,0002,330,624