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 listFeb 1, 2026 13:15kkxkkxScore: 81,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2026 13:1581,034697,052,004598,632,00073,954,0002,281,472
2Feb 1, 2026 13:1581,097702,238,773593,092,00080,012,0002,281,472
3Feb 1, 2026 13:1581,130700,947,140596,447,00076,928,0002,465,792
4Feb 1, 2026 13:1581,182698,966,484594,833,00078,977,0002,289,664
5Feb 1, 2026 13:1581,210704,349,184593,039,00081,005,0002,318,336
6Feb 1, 2026 13:1581,261697,065,274596,529,00077,938,0002,281,472
7Feb 1, 2026 13:1581,373704,258,567594,470,00080,927,0002,281,472
8Feb 1, 2026 13:1581,387701,196,136596,573,00078,943,0002,281,472
9Feb 1, 2026 13:1581,429707,048,093597,877,00077,983,0002,310,144