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 31, 2026 14:02skylookupskylookupScore: 58,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 14:0258,778508,536,715433,876,00053,984,0002,289,664
2Mar 31, 2026 14:0258,803507,302,972434,057,00054,007,0002,519,040
3Mar 31, 2026 14:0258,821511,687,585429,192,00059,026,0002,519,040
4Mar 31, 2026 14:0258,842517,638,983436,348,00052,041,0002,281,472
5Mar 31, 2026 14:0258,854507,696,730427,554,00060,936,0002,281,472
6Mar 31, 2026 14:0258,918522,364,196431,017,00058,002,0002,289,664
7Mar 31, 2026 14:0258,927520,932,730434,194,00054,898,0002,289,664
8Mar 31, 2026 14:0258,998516,806,348430,725,00058,962,0002,269,184
9Mar 31, 2026 14:0259,032512,856,528432,970,00056,996,0002,519,040