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 29, 2026 08:07Adam FolwarcznyAdam FolwarcznyScore: 48,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 08:0748,542412,248,556401,878,0001,025,0002,113,536
2Jun 29, 2026 08:0748,543412,320,393401,891,0001,022,0002,113,536
3Jun 29, 2026 08:0748,543412,224,969401,886,0001,022,0002,113,536
4Jun 29, 2026 08:0748,544412,262,726401,894,0001,026,0002,113,536
5Jun 29, 2026 08:0748,848414,860,610404,315,0001,130,0002,113,536
6Jun 29, 2026 08:0749,137417,118,627406,821,0001,018,0002,113,536
7Jun 29, 2026 08:0749,283418,437,661407,981,0001,075,0002,113,536
8Jun 29, 2026 08:0749,475420,010,573409,580,0001,069,0002,113,536
9Jun 29, 2026 08:0749,849423,146,342412,700,0001,051,0002,113,536