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 30, 2026 12:57Saif Al-HarthiSaif Al-HarthiScore: 21,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 12:5921,915192,496,328180,891,0001,007,0002,117,632
2Jun 30, 2026 12:5921,916191,283,061180,903,0001,007,0002,117,632
3Jun 30, 2026 12:5921,944191,523,257181,129,0001,010,0002,117,632
4Jun 30, 2026 12:5921,944191,631,988181,129,0001,008,0002,117,632
5Jun 30, 2026 12:5921,967191,785,037181,318,0001,009,0002,117,632
6Jun 30, 2026 12:5922,115192,898,687182,552,0001,009,0002,117,632
7Jun 30, 2026 12:5922,153193,242,252182,866,0001,008,0002,117,632
8Jun 30, 2026 12:5922,171193,377,906183,017,0001,008,0002,117,632
9Jun 30, 2026 12:5923,955208,243,288197,817,0001,010,0002,117,632