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 listAug 10, 2026 17:41Lan Hoang DaoLan Hoang DaoScore: 213,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:42213,0021,778,230,5221,704,849,00063,073,0002,113,536
2Aug 10, 2026 17:42213,0521,779,136,1241,704,243,00064,094,0002,113,536
3Aug 10, 2026 17:42213,1761,780,332,1871,703,269,00066,096,0002,113,536
4Aug 10, 2026 17:42213,1831,779,516,6361,704,366,00065,054,0002,113,536
5Aug 10, 2026 17:42213,1991,779,719,9181,703,419,00066,138,0002,113,536
6Aug 10, 2026 17:42213,2071,781,604,3701,703,538,00066,086,0002,113,536
7Aug 10, 2026 17:42213,2111,779,669,3241,703,453,00066,202,0002,113,536
8Aug 10, 2026 17:42213,2721,780,958,8581,704,106,00066,056,0002,113,536
9Aug 10, 2026 17:42213,3771,781,857,3361,703,905,00067,129,0002,113,536